Computing Packet Loss Probabilities in Multiplexer Models Using Rational Approximation
نویسندگان
چکیده
A statistical multiplexer is a basic model used in the design and the dimensioning of communication networks. The multiplexer model consists of a single server queue with constant service time and a more or less complicated arrival process. The aim is to determine the packet loss probability as a function of the capacity of the buffer. In this paper, we show how rational approximation techniques may be applied to compute the packet loss efficiently. The approach is based on the knowledge of a limited number of sample values, together with the decay rate of the probability distribution function. A strategy is proposed where the sample points are chosen automatically. The accuracy of the approach is validated by comparison with both analytical results obtained using a matrixanalytic method and simulation results.
منابع مشابه
Sensitivity analysis and fast computation of packet loss probabil- ities in multiplexer models
A statistical multiplexer is a basic model used in the design and the dimensioning of communication networks. The multiplexer model consists of a finite buffer, to store incoming packets, served by a single server with constant service time, and a more or less complicated arrival process. The aim is to determine the packet loss probability as a function of the capacity of the buffer. An exact a...
متن کاملEfficient Calculation of Cell Loss in Atm Multiplexers 1
The cell loss probability in an ATM multi-plexer is an important performance measure needed for network design and management. However, its calculation often encounters computational diiculties due to the large size of the analytical model required to compute it. In this paper, we apply rational approximation to the evaluation of the loss probabilities in ATM multi-plexers. We consider a multip...
متن کاملComputing packet loss probabilities of D-BMAP/PH/1/N queues with group services
Statistical multiplexers have been integral components of packet switches and routers on data networks. They are modeled as queueing systems with a finite buffer space, served by one or more transmission links of fixed or varying capacity. The service structure typically admits packets ofmultiple sources on a first-come first-serve (FCFS) basis. In this paper, we adhere to D-BMAP/PH/1/N queues ...
متن کاملTraffic smoothing effects of bit dropping in a packet voice multiplexer
Recent studies have shown that the superposition of packet sequences generated by packetized voice sources with speech detection exhibit high burstiness due to inherent correlations between successive interarrival times in the superposition stream. In a packet voice multiplexer without bit dropping, these correlations tend to cause significantly larger queueing delays and packet losses than wou...
متن کاملNon-Deterministic Periodic Packet Streams and their Impact on a Finite-Capacity Multiplexer
This paper considers the multiplexing of non-deterministic periodic traac sources which deliver packets periodically according to an arbitrary i.i.d. batch arrival process. The proposed traac sources are representative of the packet-stream periodicities commonly found in high-speed packet networks such as ATM. An exact analytical technique, which entails the solution of Markov chains whose dime...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Computers
دوره 52 شماره
صفحات -
تاریخ انتشار 2003